A branch-and-cut approach for minimum cost multi-level network design
نویسندگان
چکیده
منابع مشابه
A branch-and-cut approach for minimum cost multi-level network design
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on 2nding good heuristic solutions. In this study, we develop algorithms that solve the multi-level network design problem to optimality. In our approach, the problem is converted to a Steiner tree problem and is solved ...
متن کاملA branch-and-cut algorithm for capacitated network design problems
We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traac demands, the objective is to install more capacity on the edges of the network and route traac simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet deening inequaliti...
متن کاملA branch-and-cut algorithm for two-level survivable network design problems
This paper approaches the problem of designing a two-level network protected against single-edge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of the hubs through a backbone network (first network level), and the assignment of terminals to hubs and their connection through access networks (second network level). We cons...
متن کاملEnhanced formulations and branch-and-cut for the two level network design problem with transition facilities
We consider a new combinatorial optimization problem that combines network design and facility location aspects. Given a graph with two types of customers and two technologies that can be installed on the edges, the objective is to find a minimum cost subtree connecting all customers while the primary customers are served by a primary subtree that is embedded into the secondary subtree. In addi...
متن کاملHeuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in network design when quality of service is of concern. We solve a strong integer linear programming formulation based on so-called jump cuts by a novel Branch&Cut algorithm, using various heuristics including tabu search to solve the separation problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00404-0